Iterated snap rounding
نویسندگان
چکیده
منابع مشابه
Robust Geometric Computing and Optimal Visibility Coverage
1 2 Preface This book presents work in two of the most popular areas of geometric computation: Robust Geometric Computing and Optimal Visibility Coverage. Both areas have been extensively researched in recent years and attracted the attention of many researchers and developers in both the academic and the industrial worlds. The work we present here aims to contribute to this effort by providing...
متن کاملExtending the Power of Snap Rounding Variants
Snap Rounding (SR for short) is a method for converting arbitrary-precision arrangements of line segments into a fixed-precision representation. In the previous years two variants of SR were presented: Iterated Snap Rounding (ISR) and Iterated Snap Rounding with Bounded Drift (ISRBD). Their goal was to eliminate an undesirable property that SR possesses. Prior to their appearances, the capabili...
متن کاملAn intersection-sensitive algorithm for snap rounding
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running time O((n + I) log n), where I is the number of intersections between the input segments. In the worst case, our algorithm is an order of magnitude more efficient than the best previously known algorithms. We also propo...
متن کاملNew Developments in Iterated Rounding∗
Iterated rounding is a relatively recent technique in algorithm design, that despite its simplicity has led to several remarkable new results and also simpler proofs of many previous results. We will briefly survey some applications of the method, including some recent developments and giving a high level overview of the ideas. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and P...
متن کاملA Note on Iterated Rounding for the Survivable Network Design Problem
In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP) originally due to Jain [10]. The second contribution is to make some connections between hypergraphic version of SNDP (Hypergraph-SNDP) introduced in [17] an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 23 شماره
صفحات -
تاریخ انتشار 2002